polynomial time reduction造句
例句與造句
- When a language L is complete for some class B, then A L = A B provided that machines in A can execute reductions used in the completeness definition of class B . In particular, since SAT is NP-complete with respect to polynomial time reductions, P SAT = P NP.
- It's difficult to find polynomial time reduction in a sentence. 用polynomial time reduction造句挺難的
相鄰詞匯
- "polynomial texture mapping"造句
- "polynomial time"造句
- "polynomial time algorithm"造句
- "polynomial time approximation scheme"造句
- "polynomial time hierarchy"造句
- "polynomial transformation"造句
- "polynomial transformations"造句
- "polynomial vector field"造句
- "polynomial with integer coefficients"造句
- "polynomial with real coefficients"造句